/*
#include <iostream>
#include <deque>
using namespace std;

//Vectors are good at adding elements at the end ONLY, not at the beginning or middle.
//Deques are good at adding elements at the end and beginning, not in the middle. (Double Ended QUEue)

int main()
{
    deque<int> myDeque(5,0); //{0,0,0,0,0}
    for(int i = 0; i < myDeque.size(); i++)
    {
        cout << "#" << i << ": " << myDeque[i] << endl;
    }
    cout << sizeof(myDeque) << endl;
    myDeque.push_back(10);
    cout << myDeque[myDeque.size() - 1] << endl;
    cout << sizeof(myDeque) << endl;
}
*/
